An algorithm for the microaggregation problem using column generation

نویسندگان

چکیده

The field of statistical disclosure control aims to reduce the risk re-identifying an individual from disseminated data, a major concern among national agencies. Operations Research (OR) techniques have been widely used in past for protecting tabular but not microdata (i.e., files individuals and attributes). Few papers apply OR microaggregation problem, which is considered one best methods protection known be NP-hard. new heuristic approach based on column generation scheme and, unlike previous (primal) heuristics microaggregation, it also provides lower bound optimal microaggregation. Using real data that typically literature, our computational results show, first, solutions with small gaps are often achieved second, dramatic improvements obtained relative literature’s most popular heuristics.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Using Column Generation to Solve an Industrial Mixing Problem

The problem considered in this paper is a real world problem. It concerns the management of the deliveries of coal to the several plants of a coke industry firm in order to meet the demand of several clients at minimal purchasing, transportation and production cost. The problem is solved using a column generation technique. At the lower level, a mix of one ton satisfying all the client quality ...

متن کامل

Column Generation for the Container Relocation Problem

Container terminals offer transfer facilities to move containers from vessels to trucks, trains and barges and vice versa. Within the terminal the container yard serves as a temporary buffer where incoming containers are piled up in stacks. Only the topmost container of each stack can be accessed. If another container has to be retrieved, containers stored above it must be relocated first. Cont...

متن کامل

An improved approximation algorithm for the column subset selection problem

We consider the problem of selecting the “best” subset of exactly k columns from an m× n matrix A. In particular, we present and analyze a novel two-stage algorithm that runs in O(min{mn2,m2n}) time and returns as output an m × k matrix C consisting of exactly k columns of A. In the first stage (the randomized stage), the algorithm randomly selects O(k log k) columns according to a judiciously-...

متن کامل

An Exact Algorithm for the Mode Identity Project Scheduling Problem

In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Operations Research

سال: 2022

ISSN: ['0305-0548', '1873-765X']

DOI: https://doi.org/10.1016/j.cor.2022.105817